Proof Nets for the Multimodal Lambek Calculus
نویسندگان
چکیده
We present a novel way of using proof nets for the multimodal Lambek calculus, which provides a general treatment of both the unary and binary connectives. We also introduce a correctness criterion which is valid for a large class of structural rules and prove basic soundness, completeness and cut elimination results. Finally, we will present a correctness criterion for the original Lambek calculus L as an instance of our general correctness criterion.
منابع مشابه
Proof nets for display logic
Moot & Puite (2002) have introduced proof nets for the multimodal Lambek calculus NL3R. Since then, numerous other connectives have been proposed to deal with different linguistic phenomena, a par — or co-tensor, as some authors prefer to call it— together with the corresponding co-implication (Lambek 1993, Moortgat 2007, Bernardi & Moortgat 2007), Galois and dual-Galois connectives (Areces, Be...
متن کاملFiltering Axiom Links for Proof Nets
An important problem for proving statements in multimodal categorial grammar is that even when using proof nets — which improve upon proof search in natural deduction and sequent calculus by identifying all equivalent proofs — the number of possible axiom links to consider is still enormous. We will propose several efficient strategies to reduce the number of axiom links and will evaluate the r...
متن کاملGeneration in the Lambek Calculus Framework: an Approach with Semantic Proof Nets
Thc lincar logic (Girard, 1987) provides a powerful framcwork to cxprcss categorial gt'ammars (Ajdukicwicx, 1935) and Lambek calculus (Lambek, 1958), and a lot of work has presented proof nets uses for linguistic purposcs, with a special look at proof nets for Lambek calculus (Roorda, 1991; Lamarche and Retor6, 1996). But they have mainly explored the syntactic capabilities of proof nets, descr...
متن کاملProof Nets for Multiplicative Cyclic Linear Logic and Lambek Calculus
This paper presents a simple and intuitive syntax for proof nets of the multiplicative cyclic fragment (McyLL) of linear logic (LL). The proposed correctness criterion for McyLL proof nets can be considered as the non-commutative counterpart of the famous Danos contraction criterion for proof nets of the pure multiplicative fragment (MLL) of LL. Unlike the most part of current syntaxes for non-...
متن کاملGeneration, Lambek Calculus, Montague's Semantics and Semantic Proof Nets
Most of the studies in the framework of Lambek calculus have considered the parsing process and ignored the generation process. This paper wants to rely on the close link between Lambek calculus and linear logic to present a method for the generation process with semantic proof nets. We express the process as a proof search procedure based on a graph calculus and the solutions appear as a matri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Studia Logica
دوره 71 شماره
صفحات -
تاریخ انتشار 2002